Parallel-Sparse Symmetrical/Unsymmetrical Finite Element Domain Decomposition Solver with Multi-Point Constraints for Structural/Acoustic Analysis

نویسندگان

  • Siroj Tungkahotara
  • Willie R. Watson
  • Duc T. Nguyen
  • Subramaniam D. Rajan
  • SIROJ TUNGKAHOTARA
چکیده

Details of parallel-sparse Domain Decomposition (DD) with multi-point constraints (MPC) formulation are explained. Major computational components of the DD formulation are identified. Critical roles of parallel (direct) sparse and iterative solvers with MPC are discussed within the framework of DD formulation. Both symmetrical and unsymmetrical system of simultaneous linear equations (SLE) can be handled by the developed DD formulation. For symmetrical SLE, option for imposing MPC equations is also provided. Large-scale (up to 25 million unknowns involving complex numbers) structural and acoustic Finite Element (FE) analysis are used to evaluate the parallel computational performance of the proposed DD implementation using different parallel computer platforms. Numerical examples show that the authors’ MPI/FORTRAN code is significantly faster than the commercial parallel sparse solver. Furthermore, the developed software can also conveniently and efficiently solve large SLE with MPCs, a feature not available in almost all commercial parallel sparse solvers. Key-Words: Domain Decomposition Solver, Multi-Point Constraints, Parallel Computation, Symmetrical/Unsymmetrical Simultaneous Linear Equation, Finite Element Analysis, Acoustic/Structural Engineering Applications, Iterative Algorithms, Sparse Assembly, Sparse Factorization. WSEAS TRANSACTIONS on APPLIED and THEORETICAL MECHANICS Siroj Tungkahotara, Willie R. Watson, Duc T. Nguyen, Subramaniam D. Rajan ISSN: 1991-8747 37 Issue 1, Volume 6, January 2011 1 Finite Element Analysis With Domain Decomposition (DD) Formulations The finite element equilibrium equation (state equation) in terms of displacements, is given in [1][6] = K z s (1) where s = vector of effective nodal loads on the structure z = state variable vector of (e.g. nodal displacements) K = global stiffness matrix, with dimension NxN Using the DD concept, Eq. (1) can be re-written (in the partitioned form) as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Advancing Analysis Capabilities in Ansys through Solver Technology

This paper describes substantial improvements in analysis capabilities in a large scale commercial finite element program made possible by the implementation of solver technology. The ANSYS program is a commercial finite element analysis program, which has been in use for thirty years. The original code, developed around a direct frontal solver has been expanded over the years to include full f...

متن کامل

Coupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material

This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...

متن کامل

Domain Decomposition Based High Performance Parallel Computing

The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition t...

متن کامل

MPI-based parallel finite element approaches for implicit nonlinear dynamic analysis employing sparse PCG solvers

This paper presents three formulations combining domain decomposition based finite element method with linear preconditioned conjugate gradient (LPCG) technique for solving large-scale problems in structural mechanics on parallel processing machines. In the first formulation called the Global Interface Formulation (GIF), the PCG algorithm is applied on the assembled interface stiffness coeffici...

متن کامل

Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method

We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017